Linear read-once and related Boolean functions
نویسندگان
چکیده
منابع مشابه
Introducing Read-Polarity-Once Functions
Efficient exact factoring algorithms exist in the literature, but they are limited to read-once (RO) functions where each variable appears once in the final equation. These algorithms have two limitations: (1) they do not consider incompletely specified functions; and (2) they are not applicable to binate functions. To overcome the first limitation, we propose an algorithm that finds RO formula...
متن کاملTesting Monotone Read-Once Functions
A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T (f) in a checking test for any function f . The task of deriving the exact v...
متن کاملAn improvement on the complexity of factoring read-once Boolean functions
Read-once functions have gained recent, renewed interest in thefields of theory and algorithmsofBoolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A.Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. M...
متن کاملLearning Boolean Read-Once Formulas over Generalized Bases
A read-once formula is one in which each variable appears on at most a single input. Angluin, Hellerstein, and Karpinski give a polynomial time algorithm that uses membership and equivalence queries to identify exactly read-once boolean formulas over the basis fAND;OR;NOTg AHK93]. The goal of this work is to consider natural generalizations of these gates, in order to develop exact identiicatio...
متن کاملRead-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluation in probabilistic databases has largely concentrated on query-centric formulations (e.g., safe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.05.001